Studying on a Genetic-Simulation Optimization Algorithm Method for Steel Crane Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملA simulation-based immune genetic algorithm for the crane scheduling problem
The paper studied a multi-machine and multi-task warehouse crane scheduling problem. The collision between adjacent cranes needs to be avoided in the scheduling problem. Considering the involved operation requirement and condition, a process simulation model was formulated to evaluate a candidate crane schedule through rehearsing the crane operation process. Based on the process simulation, an ...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملTrain Scheduling Problem - Phase II: A Simulation Integrated Genetic AlgorithmSystem
In [1] a feasible timetable generator stochastic simulation modeling framework for the train scheduling problem was developed to obtain a train timetable which includes train arrival and departure times at all visited stations and calculated average train travel time for all trains in the system. In this study, the framework is integrated with a genetic algorithm (GA) in order to get an optimal...
متن کاملA Branch-and-Cut algorithm for factory crane scheduling problem
The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science Innovation
سال: 2016
ISSN: 2328-7861
DOI: 10.11648/j.si.20160406.17